Computation of capacity via quadratic programming

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Large-scale MV efficient frontier computation via a procedure of parametric quadratic programming

Despite the volume of research conducted on efficient frontiers, in many cases it is still not the easiest thing to compute a mean-variance (MV) efficient frontier even when all constraints are linear. This is ∗Corresponding author [email protected]

متن کامل

Bound constrained quadratic programming via piecewise quadratic functions

We consider the strictly convex quadratic programming problem with bounded variables. A dual problem is derived using Lagrange duality. The dual problem is the minimization of an unconstrained, piecewise quadratic function. It involves a lower bound of λ1, the smallest eigenvalue of a symmetric, positive definite matrix, and is solved by Newton iteration with line search. The paper describes th...

متن کامل

Approximating Quadratic 0-1 Programming via SOCP

We consider the problem of approximating Quadratic O-1 Integer Programs with bounded number of constraints and non-negative constraint matrix entries, which we term as PIQP. We describe and analyze a randomized algorithm based on a program with hyperbolic constraints (a Second-Order Cone Programming -SOCPformulation) that achieves an approximation ratio of O(amax n β(n)), where amax is the maxi...

متن کامل

Efficient Subspace Segmentation via Quadratic Programming

We explore in this paper efficient algorithmic solutions to robust subspace segmentation. We propose the SSQP, namely Subspace Segmentation via Quadratic Programming, to partition data drawn from multiple subspaces into multiple clusters. The basic idea of SSQP is to express each datum as the linear combination of other data regularized by an overall term targeting zero reconstruction coefficie...

متن کامل

Inverse Protein Folding Problem via Quadratic Programming

This paper presents a method of reconstruction a primary structure of a protein that folds into a given geometrical shape. This method predicts the primary structure of a protein and restores its linear sequence of amino acids in the polypeptide chain using the tertiary structure of a molecule. Unknown amino acids are determined according to the principle of energy minimization. This study repr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal de Mathématiques Pures et Appliquées

سال: 2010

ISSN: 0021-7824

DOI: 10.1016/j.matpur.2010.03.004